The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
نویسندگان
چکیده
منابع مشابه
An Exact Parallel Algorithm for the Maximum Clique Problem
In this paper we present a portable exact parallel algorithm for the maximum clique problem on general graphs. Computational results with random graphs and some test graphs from applications are presented. The algorithm is parallelized using the Message Passing Interface (MPI) standard. The algorithm is based on the Carraghan-Pardalos exact algorithm (for unweighted graphs) and incorporates a v...
متن کاملDistributing an Exact Algorithm for Maximum Clique: maximising the costup
We take an existing implementation of an algorithm for the maximum clique problem and modify it so that we can distribute it over an ad-hoc cluster of machines. Our goal was to achieve a significant speedup in performance with minimal development effort, i.e. a maximum costup. We present a simple modification to a state-of-the-art exact algorithm for maximum clique that allows us to distribute ...
متن کاملAn exact bit-parallel algorithm for the maximum clique problem
This paper presents a new exact maximum clique algorithm which improves the bounds obtained in state of the art approximate coloring by reordering the vertices at each step. Moreover the algorithm can make full use of bit strings to sort vertices in constant time as well as to compute graph transitions and bounds efficiently, exploiting 10 the ability of CPUs to process bitwise operations in bl...
متن کاملAn improved bit parallel exact maximum clique algorithm
This paper describes new improvements for BB-MaxClique [13], a leading maximum clique algorithm which uses bit string data structures to efficiently compute basic operations during search. Improvements include a recently described recoloring strategy in [12], which is now integrated in the bit string framework, as well as different optimization strategies for fast bit scanning. Reported results...
متن کاملA New Exact Algorithm for the Maximum Weight Clique Problem
Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the maximum weight. Östergård proposed a fast exact algorithm for solving this problem. We show his algorithm is not efficient for very dense graphs. We propose an exact algorithm for the problem, which is faster than Östergård’s algorithm in case the graph is dense. We show the eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a13100253